Information-geometric Analysis of Iterative Receiver Structures

نویسنده

  • Gerald Matz
چکیده

This thesis gives an introduction to basic concepts of information geometry, a theory that uses notions of differential geometry to describe information and probabilities. These concepts are applied to the analytic description of an iterative receiver for bit interleaved coded modulation (BICM). The operation of the receiver’s subblocks are recognized as implicit projections of input probability distributions on certain sub-manifolds, which for example represent the code. Furthermore, the effects of log-likelihood ratio (LLR) clipping onto the receiver performance are studied using information geometry. Again, clipping has an interpretation as a projection. Finally numerical simulations of a BICM system show the performance improvements due to iterative decoding and the effects of LLR clipping.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Geometrical Bases for Incremental-Iterative Methods (RESEARCH NOTE)

Finding the equilibrium path by non-linear structural analysis is one of the most important subjects in structural engineering. In this way, Incremental-Iterative methods are extremely used. This paper introduces several factors in incremental steps. In addition, it suggests some control criteria for the iterative part of the non-linear analysis. These techniques are based on the geometric of e...

متن کامل

Evaluation of Geometric and Atmospheric Doppler for GNSS-RO Payloads

To reduce the sampling rate in global navigation satellite system (GNSS)-radio occultation receivers, it is essential to establish a suitable estimation of Doppler frequency from the received signal in the satellite onboard receiver. This receiver is usually located on low earth orbit satellite and receives GNSS satellites signal in the occultation situation. The occurred Doppler on the signal ...

متن کامل

Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method

A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...

متن کامل

Low-complexity Turbo-equalization for diversity channels

A low complexity iterative receiver structure is proposed for a convolutionally coded system in a severe ISI environment where diversity reception is available. The receiver performs two successive soft decisions, £rst from a MMSE £lter and then from a channel decoder. At each iteration, extrinsic information is extracted from the detection and decoding stages and is used as a priori informatio...

متن کامل

ANT COLONY ALGORITHMS FOR NONLINEAR ANALYSIS AND OPTIMAL DESIGN OF STRUCTURES

In this paper nonlinear analysis of structures are performed considering material and geometric nonlinearity using force method and energy concepts. For this purpose, the complementary energy of the structure is minimized using ant colony algorithms. Considering the energy term next to the weight of the structure, optimal design of structures is performed. The first part of this paper contains ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008